M-PAES: A Memetic Algorithm for Multiobjective Optimization
نویسندگان
چکیده
A memetic algorithm for tackling multiobjective optimization problems is presented. The algorithm employs the proven local search strategy used in the Pareto archived evolution strategy (PAES) and combines it with the use of a population and recombination. Verification of the new algorithm is carried out by testing it on a set of multiobjective 0/1 knapsack problems. On each problem instance, comparison is made between the new memetic algorithm, the (l+l)-PAES local searcher, and the strength Pareto evolutionary algorithm (SPEA) of Zitzler and Thiele.
منابع مشابه
A Comparison of Diverse Approaches to Memetic Multiobjective Combinatorial Optimization
Memetic algorithms (MAs) are, at present, amongst the most successful approximate methods for combinatorial optimization. Recently , their range of application in this domain has been extended, with the introduction of several MAs for problems possessing multiple objectives. In this paper, we consider two of the newest of these MAs, the random directions multiple objective genetic local searche...
متن کاملA Comparative Assessment of Memetic, Evolutionary, and Constructive Algorithms for the Multiobjective d-MST Problem
Finding a minimum-weight spanning tree (MST) in a graph is a classic problem in operational research with important applications in network design. In this paper, we consider the degree-constrained multi-objective MST problem, which is NP-hard. On fteen benchmark instances, we compare the performance of three diierent algorithms: the Pareto archived evolution strategy (PAES); a new multiobjecti...
متن کاملOn the Assessment of Multiobjective Approaches to the Adaptive Distributed Database Management Problem
In this paper we assess the performance of three modern mul-tiobjective evolutionary algorithms on a real-world optimization problem related to the management of distributed databases. The algorithms assessed are the Strength Pareto Evolutionary Algorithm (SPEA), the Pareto Archived Evolution Strategy (PAES), and M-PAES, which is a Memetic Algorithm based variant of PAES. The performance of the...
متن کاملMEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization
We present in this paper a new multiobjective memetic algorithm scheme called MEMOX. In current multiobjective memetic algorithms, the parents used for recombination are randomly selected. We improve this approach by using a dynamic hypergrid which allows to select a parent located in a region of minimal density. The second parent selected is a solution close, in the objective space, to the fir...
متن کاملImplementation of Simple Multiobjective Memetic Algorithms and Its Applications to Knapsack Problems
The aim of this paper is to propose a simple but powerful multiobjective hybrid genetic algorithm and to examine its search ability through computational experiments on commonly used test problems in the literature. We first propose a new multiobjective hybrid genetic algorithm, which is designed by combining local search with an EMO (evolutionary multiobjective optimization) algorithm. In the ...
متن کامل